Supremum of Random Dirichlet Polynomials with Sub-multiplicative Coefficients
نویسنده
چکیده
We study the supremum of random Dirichlet polynomials DN (t) = ∑ N n=1 εnd(n)n , where (εn) is a sequence of independent Rademacher random variables, and d is a sub-multiplicative function. The approach is gaussian and entirely based on comparison properties of Gaussian processes, with no use of the metric entropy method.
منابع مشابه
On the Supremum of Random Dirichlet Polynomials with Multiplicative Coefficients
We study the average supremum of some random Dirichlet polynomials DN (t) = ∑ N n=1 εnd(n)n , where (εn) is a sequence of independent Rademacher random variables, the weights (d(n)) satisfy some reasonable conditions and 0 ≤ σ ≤ 1/2. We use an approach based on methods of stochastic processes, in particular the metric entropy method developed in [8].
متن کاملOn the Supremum of Some Random Dirichlet Polynomials
We study the average supremum of some random Dirichlet polynomials DN (t) = ∑ N n=1 εnd(n)n , where (εn) is a sequence of independent Rademacher random variables, the weights (d(n)) satisfy some reasonable conditions and 0 ≤ σ ≤ 1/2. We use an approach based on methods of stochastic processes, in particular the metric entropy method developed in [8].
متن کاملOn the Supremum of Random Dirichlet Polynomials
logN . One can refer to Bohr [B], Bohnenblust and Hille [BH], Helson [H], Hardy and Riesz [HR], Queffélec [Q3] for this background and related results. This of course, basically justifies the investigation of the supremum of Dirichlet polynomials (see for instance Konyagin and Queffélec [KQ]). The following classical reduction step enables to replace the Dirichlet polynomial by some relevant tr...
متن کاملExpected Supremum of a Random Linear Combination of Shifted Kernels
We address the expected supremum of a linear combination of shifts of the sinc kernel with random coefficients. When the coefficients are Gaussian, the expected supremum is of order √ log n, where n is the number of shifts. When the coefficients are uniformly bounded, the expected supremum is of order log log n. This is a noteworthy difference to orthonormal functions on the unit interval, wher...
متن کاملOn Classifications of Random Polynomials
Let $ a_0 (omega), a_1 (omega), a_2 (omega), dots, a_n (omega)$ be a sequence of independent random variables defined on a fixed probability space $(Omega, Pr, A)$. There are many known results for the expected number of real zeros of a polynomial $ a_0 (omega) psi_0(x)+ a_1 (omega)psi_1 (x)+, a_2 (omega)psi_2 (x)+...
متن کامل